منابع مشابه
Random Walks with “Back Buttons”∗
We introduce backoff processes, an idealized stochastic model of browsing on the world-wide web, which incorporates both hyperlink traversals and use of the “back button.” With some probability the next state is generated by a distribution over out-edges from the current state, as in a traditional Markov chain. With the remaining probability, however, the next state is generated by clicking on ...
متن کاملRandom Walks with Random Projections
Random projections have been widely used for dimensionality reduction of high dimensional problems. In this paper we show how to compute some popular random walk based proximity measures (hitting and commute times, personalized pagerank) using random projections in undirected graphs. A number of important graph-based real world applications such as image segmentation, collaborative filtering in...
متن کاملRandom walks with random velocities.
We consider a random walk model that takes into account the velocity distribution of random walkers. Random motion with alternating velocities is inherent to various physical and biological systems. Moreover, the velocity distribution is often the first characteristic that is experimentally accessible. Here, we derive transport equations describing the dispersal process in the model and solve t...
متن کاملUsability of Back of Device Virtual Buttons
Back of device touch screen capable game systems have been commercially available since the release of the Playstation Vita in 2012, however the use of these touch screens in games has been limited. With the release of the touch screen lacking Playstation Vita TV, it seemed as though the use of the second touch screen would become even less common as developers produce games with features commo...
متن کاملRandom Walks with Few Random Generators
Let G be a nite group. Choose a set S of size k uniformly from G and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of S given k = 2 a log 2 jGj, a > 1, this walk mixes in under m = 2a log a a?1 log jGj steps. A similar result was obtained earlier by Alon and Roichman (see AR]), Dou and Hildebrand (see DH]) using a diierent techniques. We also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2001
ISSN: 1050-5164
DOI: 10.1214/aoap/1015345350